package com.kdtree;

import com.jsurf.InterestPoint;

public class KDNode {
	int keyIndex;               // partition key index
	double keyValue;            // partition key value
	int leaf;                   // 1 if node is a leaf, 0 otherwise
	InterestPoint[] features;   // features at this node
	int n;                      // number of features
	KDNode kdLeft;              // left child
	KDNode kdRight;             // right child
}
